Design of Heterogeneous Traffic Networks Using Simulated Annealing Algorithms

We propose a global design procedure for heterogeneous networks , which includes the definition of their topology; routing procedures; link capacity assignment; transfer mode; and traffic policy. We discuss the network model, which minimizes the cost of interconnecting a number of nodes whose locations are known; the traffic model, where we use the concept of Equivalent Bandwidth, and the resolution algorithms, where we compare a Simulated annealing algorithm (SAA) with a commercial solver, with good results. Results show that SAA gets to the optimum solution over 10 times faster than the commercial solver. Experiments also show that, for networks with more than 50 nodes, the SAA still delivers good feasible solutions while the commercial solver is unable to deliver results.